Formalizing Actions in Branching Time Model Theoretic Considerations

نویسنده

  • Munindar P Singh
چکیده

The formalization of actions is essential to AI Several approaches have been pro posed over the years However most ap proaches concentrate on the causes and ef fects of actions but do not give general characterizations of actions themselves A useful formalization of actions would be based on a general possibly nondiscrete model of time that allows branching to capture agents choices A good formal ization would also allow actions to be of arbitrary duration and would permit mul tiple agents to act concurrently We de velop a branching time framework that al lows great exibility in how time and ac tion are modeled We motivate and for malize several coherence constraints on our models which capture some nice intuitions and validate some useful inferences relat ing actions with time

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On A- and B-theoretic elements of branching spacetimes

This paper assesses branching spacetime theories in light of metaphysical considerations concerning time. I present the A, B, and C series in terms of the temporal structure they impose on sets of events, and raise problems for two elements of extant branching spacetime theories—McCall’s ‘branch attrition’, and the ‘no backward branching’ feature of Belnap’s ‘branching space-time’—in terms of t...

متن کامل

An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty, making them essentially useless for mod...

متن کامل

Branching-Time Temporal Logic and Tree Automata

JJ89] C. Jard and T. Jeron. On-line model-checking for nite linear temporal logic speciications. 6 Conclusions In this paper we showed that tree automata, which have been considered unsuitable for branching-time model checking, provide a neat and optimal framework for branching-time temporal logics and can handle, eeciently, model checking. The crucial point in our method is that when branching...

متن کامل

Semantical considerations on intention dynamics for BDI agents

The BDI paradigm is a powerful means for constructing intelligent agents in terms of their beliefs, d esires, and i ntentions. For this paradigm to bear its full potential, it must incorporate considerations from rationality. This paper develops a set of postulates for intelligent agents who deliberate about their intentions and actions. However, even simple postulates can lead to paradoxical r...

متن کامل

A Game-Theoretic Approach to Branching Time Abstract-Check-Refine Process

Since the complexity of software systems continues to grow, most engineers face two serious problems: the state space explosion problem and the problem of how to debug systems. In this paper, we propose a game-theoretic approach to full branching time model checking on three-valued semantics. The three-valued models and logics provide successful abstraction that overcomes the state space explos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995